Clausal Tableaux for Multimodal Logics of Belief
نویسندگان
چکیده
We develop clausal tableau calculi for seven multimodal logics variously designed for reasoning about multi-degree belief, reasoning about distributed systems of belief and for reasoning about epistemic states of agents in multi-agent systems. Our tableau calculi are sound, complete, cut-free and have the analytic superformula property, thereby giving decision procedures for all of these logics. We also use our calculi to obtain complexity results for five of these logics. The complexity of one was known and that of the seventh remains open.
منابع مشابه
A Modal-Layered Resolution Calculus for K
Resolution-based provers for multimodal normal logics require pruning of the search space for a proof in order to deal with the inherent intractability of the satisfiability problem for such logics. We present a clausal modal-layered hyper-resolution calculus for the basic multimodal logic, which divides the clause set according to the modal depth at which clauses occur. We show that the calcul...
متن کاملClausal Graph Tableaux for Hybrid Logic with Eventualities and Difference
We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. They provide an abstract method of establishing the small model property of modal logics. In contrast to the filtration method, clausal graph tableaux result in goal-directed decision procedures. Until now no ...
متن کاملThe proof complexity of analytic and clausal tableaux
It is widely believed that a family n of unsatis able formulae proposed by Cook and Reckhow in their landmark paper (Proc. ACM Symp. on Theory of Computing, 1974) can be used to give a lower bound of 2 (2 n) on the proof size with analytic tableaux. This claim plays a key role in the proof that tableaux cannot polynomially simulate tree resolution. We exhibit an analytic tableau proof for n for...
متن کاملCraig Interpolation and Access Interpolation with Clausal First-Order Tableaux
We show methods to extract Craig-Lyndon interpolants and access interpolants from clausal first-order tableaux as produced by automated first-order theorem provers based on model elimination, the connection method, the hyper tableau calculus and instance-based methods in general. Smullyan introduced an elegant method for interpolant extraction from “non-clausal” first-order tableaux. We transfe...
متن کاملA New Space Bound for the Modal Logics
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto known for the considered logics. In particular space requirements for our logics are reduced from the previously established bound O(n. logn) to O(n. logn).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 94 شماره
صفحات -
تاریخ انتشار 2009